Mirror Procedure for One-Shot-Coding of finite state machines

نویسنده

  • Wilfried Eisele
چکیده

In this paper a procedure is shown to modify a finite state machine in such a way that an OneShot-Coding of their states is possible. The characteristic of One-Shot-Codes for finite state machines result in some properties of the realized sequential networks. The main advantage is less power dissipation, better electromagnetic compatibility and very fast circuits because only one bit changes between all successive states.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Finite State Machine Binary Entropy Coding

A method of universal binary entropy coding using simple state machines is presented. We provide a natural rationale for the use of state machines. We discuss the building of state machines which produce uniquely decodable bit streams. Some state machines implement known codes, while others implement finite or even infinite variable length to variable length codes. Once a decodable state machin...

متن کامل

N-Policy for M/G/1 Machine Repair Model with Mixed Standby Components, Degraded Failure and Bernoulli Feedback

In this paper, we study N-policy for a finite population Bernoulli feedback queueing model for machine repair problem with degraded failure. The running times of the machines between breakdowns have an exponential distribution. The repair times of the machines are independent and identically distributed random variables. If at any time a machine fails, it is sent to the repairman for repairing,...

متن کامل

Gurevich Abstract State Machines and Schh Onhage Storage Modiication Machines

We demonstrate that Schonhage storage modi cation machines are equivalent, in a strong sense, to unary abstract state machines. We also show that if one extends the Schonhage model with a pairing function and removes the unary restriction, then equivalence between the two machine models survives.

متن کامل

Side Effects of Shot Peening on Fatigue Crack Initiation Life

Shot peening beneficial effects on fatigue life of mechanical components are well known. However, there are some reports in the literature that indicate inappropriate shot peening parameters tend to reduce the fatigue life. It is therefore, the purpose of this study to find a logical quantitative justification for these observations. Using finite element method, a dynamic elastic-plastic simula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000